Which ergodic averages have finite asymptotic variance?
نویسندگان
چکیده
منابع مشابه
Convergence of Diagonal Ergodic Averages
The case l = 1 is the mean ergodic theorem, and the result can be viewed as a generalization of that theorem. The l = 2 case was proven by Conze and Lesigne [Conze and Lesigne, 1984], and various special cases for higher l have been shown by Zhang [Zhang, 1996], Frantzikinakis and Kra [Frantzikinakis and Kra, 2005], Lesigne [Lesigne, 1993], and Host and Kra [Host and Kra, 2005]. Tao’s argument ...
متن کاملLocal Stability of Ergodic Averages
We consider the extent to which one can compute bounds on the rate of convergence of a sequence of ergodic averages. It is not difficult to construct an example of a computable Lebesgue-measure preserving transformation of [0, 1] and a characteristic function f = χA such that the ergodic averages Anf do not converge to a computable element of L ([0, 1]). In particular, there is no computable bo...
متن کاملErgodic averages with deterministic weights
i.e., there exists a constant C such that SN(θ, u) ≤ CN . We define δ(θ, u) to be the infimum of the δ satisfying H1 for θ and u. About H1, in the case where θ takes its values in U (the set of complex numbers of modulus 1), it is clear that for all sequences θ and u, δ(θ, u) is smaller than or equal to 1 and it is well-known (see [Ka] for example) that it is greater than or equal to 1/2. Few e...
متن کامل20 08 Buildings have finite asymptotic dimension
Generally we use definitions and notation as in [D]. In particular, (W,S) is a finitely generated Coxeter system, C is a building with Weyl group W , |C| is the Davis realization of C. We will, however, confuse the Coxeter group and its abstract Coxeter complex, denoting both by W ; in particular, |W | denotes the Davis complex. The W -valued distance in C will be denoted δC , while δ will be t...
متن کاملPointwise Convergence of Some Multiple Ergodic Averages
We show that for every ergodic system (X, μ,T1, . . . ,Td) with commuting transformations, the average 1 Nd+1 ∑ 0≤n1,...,nd≤N−1 ∑ 0≤n≤N−1 f1(T n 1 d ∏ j=1 T n j j x) f2(T n 2 d ∏ j=1 T n j j x) · · · fd(T n d d ∏ j=1 T n j j x). converges for μ-a.e. x ∈ X as N → ∞. If X is distal, we prove that the average 1 N N ∑ i=0 f1(T n 1 x) f2(T n 2 x) · · · fd(T n d x) converges for μ-a.e. x ∈ X as N → ∞...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Applied Probability
سال: 2018
ISSN: 1050-5164
DOI: 10.1214/17-aap1358